home *** CD-ROM | disk | FTP | other *** search
- Path: valour.pem.cam.ac.uk!not-for-mail
- From: cbrown@armltd.co.uk (Chris Brown)
- Newsgroups: comp.sys.amiga.advocacy,comp.sys.amiga.misc
- Subject: Re: Walker vs. the $999 7200/75 w/4xCD!
- Date: 1 Apr 1996 21:03:47 +0100
- Organization: Advanced RISC Machines Limited
- Message-ID: <4jpcr3$6ni@valour.pem.cam.ac.uk>
- References: <eraugust-2803960910170001@sbdsk0838.sbrc.hac.com> <1350.6662T1401T2752@mbox.vol.it>
- NNTP-Posting-Host: valour.pem.cam.ac.uk
-
- In article <1350.6662T1401T2752@mbox.vol.it>,
- Fabio Bizzetti <bizzetti@mbox.vol.it> wrote:
- >
- >1-2 years and RISC will return in the garage: where it _always_ has
- >been.
-
- Your assertion is silly. One of the main reasons why RISC processors
- came about in the first place was that memory was too slow for CISC
- processors, with thier instructions that operated directly on
- memory. RISC processors have as their only memory operations loads and
- stores, with lots of registers to keep their data in. This serialises
- memory accesses more which means burst mode can be very well utilised,
- and is kinder on caches. Compare with, say the P6, a CISC chip, which
- needs an enormous and fast level 2 cache to perform well.
-
- >Untill someone makes 5ns main ram (!) and RISC's can go out again, untill
- >we get BiCMOS technology for CPU's and at 700Mhz and 20 millions of transistors
- >CISC wins again in any case.
-
- Huh? You are aware that one of the purest RISC designs around today is
- the DEC Alpha, right? It's also the fastest commercially available
- microprocessor by a *long* way.
-
- >Sorry, but the future is for CISC processors (as programming structure) with
- >as many parts as possible implemented in RISC architecture.
-
- This is bad because putting the translation logic on the front to
- RISCify the instruction stream will slow the processor down,
- complicate its design and lengthen the pipeline (P6 has something
- crazy like 14 pipeline stages. Missing a branch is pretty catastrophic
- for it).
- --
- /* _ */main(int k,char**n){char*i=k&1?"+L*;99,RU[,RUo+BeKAA+BECACJ+CAACA"
- /* / ` */"CD+LBCACJ*":1[n],j,l=!k,m;do for(m=*i-48,j=l?m/k:m%k;m>>7?k=1<<m+
- /* | */8,!l&&puts(&l)**&l:j--;printf(" \0_/"+l));while((l^=3)||l[++i]);}
- /* \_,hris Brown -- All opinions expressed are probably wrong. */
-